2 00 6 Classification of Lattice - Regular Lattice Convex Polytopes
نویسنده
چکیده
In this paper for any dimension n we give a complete list of lattice convex polytopes in R that are regular with respect to the group of affine transformations preserving the lattice.
منابع مشابه
M ar 2 00 6 CLASSIFICATION OF LATTICE - REGULAR LATTICE CONVEX POLYTOPES
In this paper for any dimension n we give a complete description of lattice convex polytopes in R that are regular with respect to the group of affine transformations preserving the lattice.
متن کامل6 Classification of Lattice - Regular Lattice Convex
In this paper for any dimension n we give a complete description of lattice convex polytopes in R that are regular with respect to the group of affine transformations preserving the lattice.
متن کاملDensest lattice packings of 3-polytopes
Based on Minkowski’s work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
متن کامل3-Dimensional Lattice Polytopes Without Interior Lattice Points
A theorem of Howe states that every 3-dimensional lattice polytope P whose only lattice points are its vertices, is a Cayley polytope, i.e. P is the convex hull of two lattice polygons with distance one. We want to generalize this result by classifying 3-dimensional lattice polytopes without interior lattice points. The main result will be, that they are up to finite many exceptions either Cayl...
متن کاملInstitute for Mathematical Physics Densest Lattice Packings of 3{polytopes Densest Lattice Packings of 3{polytopes
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an eecient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
متن کامل